Linear programming-based estimators in nonnegative autoregression
نویسندگان
چکیده
منابع مشابه
Autoregression-Based Estimators for ARFIMA Models
Ce document est publié dans l'intention de rendre accessibles les résultats préliminaires de la recherche effectuée au CIRANO, afin de susciter des échanges et des suggestions. Les idées et les opinions émises sont sous l'unique responsabilité des auteurs, et ne représentent pas nécessairement les positions du CIRANO ou de ses partenaires. This paper presents preliminary research carried out at...
متن کاملEstimators for alternating nonlinear autoregression
Suppose we observe a time series that alternates between different nonlinear autoregressive processes. We give conditions under which the model is locally asymptotically normal, derive a characterization of efficient estimators for differentiable functionals of the model, and use it to construct efficient estimators for the autoregression parameters and the innovation distributions. Surprisingl...
متن کاملSparse nonnegative solution of underdetermined linear equations by linear programming.
Consider an underdetermined system of linear equations y = Ax with known y and d x n matrix A. We seek the nonnegative x with the fewest nonzeros satisfying y = Ax. In general, this problem is NP-hard. However, for many matrices A there is a threshold phenomenon: if the sparsest solution is sufficiently sparse, it can be found by linear programming. We explain this by the theory of convex polyt...
متن کاملLimiting distributions of linear programming estimators
Smith (1994) proposes estimation in linear regression models with non-negative errors by maximizing the sum of tted values subject to the constraint that the tted values can be no larger than the corresponding response value. In this paper, we consider the limiting distribution of these estimators under very general conditions. Some extensions to local polynomial estimation are also considered.
متن کاملConstraint Optimal Selection Techniques (COSTs) for nonnegative linear programming problems
where x is an n-dimensional column vector of variables; A is an m×n matrix [aij ] with m rows of transposed n-dimensional column vectors ai , ∀i = 1, . . . ,m; b is an m-dimensional column vector; c is an n-dimensional column vector; and 0 is a column vector of zeros of appropriate dimension according to context. Simplex pivoting algorithms and polynomial interior-point barrier-function methods...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Banking & Finance
سال: 2015
ISSN: 0378-4266
DOI: 10.1016/j.jbankfin.2015.08.010